On an Inequality of A. Grothendieck
نویسنده
چکیده
In 1955, A. Grothendieck proved a basic inequality which shows that any bounded linear operator between L(μ)-spaces maps (Lebesgue-) dominated sequences to dominated sequences. An elementary proof of this inequality is obtained via a new decomposition principle for the lattice of measurable functions. An exposition is also given of the M. Lévy extension theorem for operators defined on subspaces of L(μ)spaces.
منابع مشابه
Recent Work on the Propeller Conjecture
How can one prove a sharp inequality? Symmetrization, Fourier analysis, and probability are often used, and we will survey some of these methods through examples. We then survey sharp constants in Grothendieck inequalities, leading to some recent work on computing the best constant for a Grothendieck-type inequality of Khot and Naor. (Joint work with Aukosh Jagannath and Assaf Naor)
متن کاملA Moment Majorization principle for random matrix ensembles with applications to hardness of the noncommutative Grothendieck problem
We prove a moment majorization principle for matrix-valued functions with domain {−1, 1}m, m ∈ N. The principle is an inequality between higher-order moments of a non-commutative multilinear polynomial with different random matrix ensemble inputs, where each variable has small influence and the variables are instantiated independently. This technical result can be interpreted as a noncommutativ...
متن کاملApproximating the Little Grothendieck Problem over the Orthogonal Group
The little Grothendieck problem (a special case of Boolean quadratic optimization) consists of maximizing ∑ ij Cijxixj over binary variables xi ∈ {±1}, where C is a positive semidefinite matrix. In this paper we focus on a natural generalization of this problem, the little Grothendieck problem over the orthogonal group. Given C ∈ Rdn×dn a positive semidefinite matrix, the objective is to maximi...
متن کاملGrothendieck-type inequalities in combinatorial optimization
We survey connections of the Grothendieck inequality and its variants to combinatorial optimization and computational complexity.
متن کاملGrothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the integrality gap between two optimization problems: A difficult semidefinite program with rank-1 constraint and its easy semidefinite relaxation where the rank constrained is dropped. For instance, the integrality gap ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997